ACTA: Average of Completion Times Algorithm
نویسندگان
چکیده
منابع مشابه
Weighted sum of completion times
4. Weighted sum of completion times 1 Eugene L. Lawler, Maurice Queyranne, Andreas S. Schulz, David B. Shmoys 4.1. Smith’s ratio rule 2 4.2. Preference orders on jobs 5 4.3. Preference orders on sequences and series-parallel precedence constraints 8 4.4. NP-hardness of further constrained min-sum problems 14 4.5. The ratio rule via linear programming 18 4.6. Approximation algorithms for 1|prec|...
متن کاملAn Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time
This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...
متن کاملScheduling by Positional Completion Times
We present a new type of formulation for scheduling problems where jobs are identical in all aspects but one. This type of formulation is particularly useful for deriving Lagrangian lower and upper bounds for owshop problems, where the jobs only diier in their processing times. We illustrate the eeectiveness of this type of formulation for a two-machine owshop problem where the rst machine is a...
متن کاملEvaluating project completion times when activity times are Weibull distributed
Activity networks have been used to model complex projects with wide applications in the field of production, planning and control. Stochastic activity networks (SANs) require a priori distribution function (d.f.) such as normal, exponential, Erlang and others. In this paper, a development of the moments method based on Weibull distribution of activity time is presented. The method provides an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2017
ISSN: 0975-8887
DOI: 10.5120/ijca2017915193